A Contractor Based on Convex Interval Taylor
نویسندگان
چکیده
Interval Taylor has been proposed in the sixties by the interval analysis community for relaxing continuous non-convex constraint systems. However, it generally produces a non-convex relaxation of the solution set. A simple way to build a convex polyhedral relaxation is to select a corner of the studied domain/box as expansion point of the interval Taylor form, instead of the usual midpoint. The idea has been proposed by Neumaier to produce a sharp range of a single function and by Lin and Stadtherr to handle n× n (square) systems of equations. This paper presents an interval Newton-like operator, called X-Newton, that iteratively calls this interval convexification based on an endpoint interval Taylor. This general-purpose contractor uses no preconditioning and can handle any system of equality and inequality constraints. It uses Hansen’s variant to compute the interval Taylor form and uses two opposite corners of the domain for every constraint. The X-Newton operator can be rapidly encoded, and produces good speedups in constrained global optimization and constraint satisfaction. First experiments compare X-Newton with affine arithmetic.
منابع مشابه
Hull Consistency under Monotonicity
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. This result holds including when variables have multiple occurrences in the expressions of the functions, which is usually a pitfall for interval-based contractors. For a given constraint, an optimal contr...
متن کاملA remark on associative copulas
Amethod for producing associative copulas from a binary operation and a convex function on an interval is described.
متن کاملAn Eigenvalue Symmetric Matrix Contractor
We propose an eigenvalue contractor for symmetric matrices. Given a symmetric interval matrix A and an interval approximation of its eigenvalue sets λ1, . . . ,λn the contractor reduces the entries of A S such that no matrix with eigenvalues in λ1, . . . ,λn is omitted. Our contractor is based on sequentially reducing the entries of A. We discuss properties of the method and demonstrate its per...
متن کاملM-FUZZIFYING INTERVAL SPACES
In this paper, we introduce the notion of $M$-fuzzifying interval spaces, and discuss the relationship between $M$-fuzzifying interval spaces and $M$-fuzzifying convex structures.It is proved that the category {bf MYCSA2} can be embedded in the category {bf MYIS} as a reflective subcategory, where {bf MYCSA2} and {bf MYIS} denote the category of $M$-fuzzifying convex structures of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012